A Discrete - Time Analysis of Random Early
نویسندگان
چکیده
Random Early Detection (RED) has been introduced as a congestion avoidance algorithm for the Internet. RED detects congestion by estimating the average queue size. It drops packets probabilistically before buuer overrow, with the drop probability depending on the average queue size. In this paper, we analyse the innuence of RED on the packet loss ratio and the throughput of a system consisting of a number of homogeneous responsive traac sources which share a RED switch.
منابع مشابه
T-S FUZZY MODEL-BASED MEMORY CONTROL FOR DISCRETE-TIME SYSTEM WITH RANDOM INPUT DELAY
A memory control for T-S fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. Dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. A new state space model of the discrete-time T-S fuzzy system is derived by introducing some stocha...
متن کاملWavelet Based Estimation of the Derivatives of a Density for a Discrete-Time Stochastic Process: Lp-Losses
We propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for such estimators. We suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...
متن کاملPole Assignment Of Linear Discrete-Time Periodic Systems In Specified Discs Through State Feedback
The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...
متن کاملConstrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random Times
In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the proj...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کامل